Unambiguous injective morphisms in free groups

نویسندگان

چکیده

A morphism g is ambiguous with respect to a word u if there exists second h≠g such that g(u)=h(u). Otherwise unambiguous u. Thus morphisms are those for which the structure of preserved in image. Ambiguity has so far been studied free monoids, where several characterisations exist set words permitting an (injective) morphism. In present paper, we consider ambiguity groups, and possible analogies existing monoid. While direct generalisation results trivial situation all ambiguous, discuss some natural well-motivated reformulations, provide characterisation group permit “as as possible”.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unambiguous Erasing Morphisms in Free Monoids

[FRS06] characterises strings with an unambiguous image of an nonerasing morphism. Only few results are known when regarding all (possibly erasing) morphisms.

متن کامل

A note on the continuous extensions of injective morphisms between free groups to relatively free profinite groups

Let V be a pseudovariety of finite groups such that free groups are residually V, and let φ:F (A) → F (B) be an injective morphism between finitely generated free groups. We characterize the situations where the continuous extension φ̂ of φ between the pro-V completions of F (A) and F (B) is also injective. In particular, if V is extension-closed, this is the case if and only if φ(F (A)) and its...

متن کامل

Unambiguous 1-uniform morphisms

If, for a morphism σ : ∆∗ → Σ∗ (where ∆ and Σ are arbitrary alphabets) and a word α ∈ ∆∗, there exists another morphism τ mapping α to σ(α), then σ is called ambiguous with respect to α ; if such a τ does not exist, then σ is unambiguous. For example, the morphism σ0 : {A,B,C}∗ → {a,b}∗ – given by σ0(A) := a, σ0(B) := a, σ0(C) := b – is ambiguous with respect to the word α0 := ABCACB, since the...

متن کامل

Weakly Unambiguous Morphisms

A nonerasing morphism σ is said to be weakly unambiguous with respect to a word s if σ is the only nonerasing morphism that can map s to σ(s), i. e., there does not exist any other nonerasing morphism τ satisfying τ(s) = σ(s). In the present paper, we wish to characterise those words with respect to which there exists such a morphism. This question is nontrivial if we consider so-called length-...

متن کامل

Free Adjunction of Morphisms

We develop a general setting for the treatment of extensions of categories by means of freely adjoined morphisms. To this end, we study what we call composition graphs, i.e. large graphs with a partial binary operation on which we impose only rudimentary requirements. The quasicategory thus obtained contains the quasicategory of all categories as a full reflective subquasicategory; we character...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information & Computation

سال: 2022

ISSN: ['0890-5401', '1090-2651']

DOI: https://doi.org/10.1016/j.ic.2022.104946